Decomposing TAG Algorithms Using Simple Algebraizations
نویسندگان
چکیده
We review a number of different ‘algebraic’ perspectives on TAG and STAG in the framework of interpreted regular tree grammars (IRTGs). We then use this framework to derive a new parsing algorithm for TAGs, based on two algebras that describe strings and derived trees. Our algorithm is extremely modular, and can easily be adapted to the synchronous case.
منابع مشابه
Decomposing Lie Algebra Representations Using Crystal Graphs
We use the theory of crystal graphs to give a simple graph-theoretical algorithm for determining the branching rule for decomposing a representation of a simple Lie algebra when restricted to a simple subalgebra. We also describe a computer package for determining such decomposi-tions graphically. 0.1 Introduction When modeling elementary particle interactions and symmetry breaking in physics i...
متن کاملافزایش سرعت شناسایی در سیستم‌های RFID
Radio frequency identification (RFID) is a new generation of automatic identification systems, based on wireless communication technology. In these systems all the tags using one communication channel to communicate with the reader. When two or more tags transmit their data to the reader simultaneously, their transmitted signals will collide. Resolving this collision has a direct impact on the ...
متن کاملA Contribution to Triangulation Algorithms for Simple Polygons
Decomposing simple polygon into simpler components is one of the basic tasks in computational geometry and its applications. The most important simple polygon decomposition is triangulation. The known algorithms for polygon triangulation can be classified into three groups: algorithms based on diagonal inserting, algorithms based on Delaunay triangulation, and the algorithms using Steiner point...
متن کاملComplexity Analysis: Finite Transformation Monoids
We examine the computational complexity of some problems from algebraic automata theory and from the field of communication complexity: testing Green’s relations (relations that are fundamental in monoid theory), checking the property of a finite monoid to have only Abelian subgroups, and determining the deterministic communication complexity of a regular language. By well-known algebraizations...
متن کاملAn improved accelerated frame slotted aloha (afsa) algorithm for tag collision in rfid
The efficiency of tag identification in an RFID (radio identification system) can be low down due to the tag collision problems. The tag collision problem occurs when a reader try to read multiple tags in an interrogation zone. As a result, the reader doesn’t identify the tag correctly. That causes a loss of information or data interference. To solve such kind of issues a series of ALOHA based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012